An expansion for self-interacting random walks
نویسندگان
چکیده
We derive a perturbation expansion for general interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the true (weakly) self-avoiding walk and loop-erased random walk. We use the expansion to prove a law of large numbers and central limit theorem for two models: (i) A directed version of once-reinforced random walk on Zd for sufficiently small reinforcement parameters. This model is such that if the reinforcement parameter is set to zero, then the resulting random walk has independent increments with a non-zero drift; and (ii) Excited random walk in dimension d > 8 when the excitement parameter is sufficiently small.
منابع مشابه
A monotonicity property for random walk in a partially random environment
We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Zd that is an extension of a result of Bolthausen, Sznitman and Zeitouni [4]. We use this result, along with the lace expansion for self-interacting random walks, to prove a monotonicity result for the first coordinate of the speed of the random walk under some strong assumptions on the distributi...
متن کاملBallistic Phase of Self-Interacting Random Walks
We explain a unified approach to a study of ballistic phase for a large family of self-interacting random walks with a drift and self-interacting polymers with an external stretching force. The approach is based on a recent version of the OrnsteinZernike theory developed in Campanino et al. (2003, 2004, 2007). It leads to local limit results for various observables (e.g., displacement of the en...
متن کاملA Self-avoiding Walk with Attractive Interactions
A powerful tool for the study of self-avoiding walks is the lace expansion of Brydges and Spencer [BS]. It is applicable above four dimensions and shows the mean-field behavior of self-avoiding walks, that is, critical exponents are those of the simple random walk. An extensive survey of random walks can be found in [MS]. The lace expansion was originally introduced for weakly self-avoiding wal...
متن کاملA combinatorial result with applications to self-interacting random walks
We give a series of combinatorial results that can be obtained from any two collections (both indexed by Z×N) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting random walk couplings, these allow us to reprove some known transience and recurrence results for some simple models. We also obtain new results for one-dimensional multi-e...
متن کاملRandom Walks and Evolving Sets: Faster Convergences and Limitations
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more combinatorial graph structures, and show some implications in approximating small-set expansion. On the other hand, we provide examples showing the limitations of using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006